//
// Created by Jisam on 07/09/2024 7:13 PM.
// Solution of  a
//#pragma GCC optimize(3)
#include <bits/stdc++.h>

using namespace std;
#define endl "\n"
#define PSI pair<string,int>
#define PII pair<int,int>
#define PDI pair<double,int>
#define PDD pair<double,double>
#define VVI vector<vector<int>>
#define VI vector<int>
#define VS vector<string>
#define PQLI priority_queue<int, vector<int>, less<int>>
#define PQGI priority_queue<int, vector<int>, greater<int>>
#define code_by_jisam ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
typedef long long i64;
typedef unsigned u32;
typedef unsigned long long u64;
typedef __int128 i128;
int dx[] = {-1, 1, 0, 0, 1, 1, -1, -1,};
int dy[] = {0, 0, -1, 1, 1, -1, -1, 1,};
const int maxn = 1e5;
int a[maxn];
void solution() {
    for(int i = 1; i < 20; i ++){
        memset(a,0,sizeof a);

        for(int j = 1; j <= i ; j ++){
            for(int k = j;k <= i ; k ++){
                if(k % j == 0){
                    a[k] = !a[k];
                }
            }
        }

        for(int j = 1 ; j <= i ; j++){
            if(a[j] == 1) cout << j <<" ";
        }
        cout << "\n";

    }
}

int main() {
    code_by_jisam;
    int T = 1;
//    cin >> T;
    while (T--) {
        solution();
    }
    return 0;
}